On lower bounds of exponential frames

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On lower bounds of exponential frames

Lower frame bounds for sequences of exponentials are obtained in a special version of Avdonin’s theorem on ”1/4 in the mean” (1974) and in a theorem of Duffin and Schaeffer (1952).

متن کامل

Explicit Bounds of Complex Exponential Frames

We discuss the stability of complex exponential frames {eiλnx} in L2(−γ,γ), γ > 0. Specifically, we improve the 1/4-theorem and obtain explicit upper and lower bounds for some complex exponential frames perturbed along the real and imaginary axes, respectively. Two examples are given to show that the bounds are best possible. In addition, the growth of the entire functions of exponential type γ...

متن کامل

Exponential Lower Bounds on the Size of Clause BasedSemantic

We consider the clause{based version of the general model of semantic derivations proposed by Kraj cek. Resolution refutation proof is a special deterministic version of fanin-2 clause{based derivation. We prove the following combinatorial lower bound on the length of such derivations. Let F be a k-partite hypergraph, with at most b points in each part such that no point belongs to more than d ...

متن کامل

Exponential lower bounds on spectrahedral representations of hyperbolicity cones

The Generalized Lax Conjecture asks whether every hyperbolicity cone is a section of a semidefinite cone of sufficiently high dimension. We prove that the space of hyperbolicity cones of hyperbolic polynomials of degree d in n variables contains (n/d) pairwise distant cones in the Hausdorff metric, and therefore that any semidefinite representation of such polynomials must have dimension at lea...

متن کامل

Exponential Lower Bounds for Policy Iteration

We study policy iteration for infinite-horizon Markov decision processes. It has recently been shown policy iteration style algorithms have exponential lower bounds in a two player game setting. We extend these lower bounds to Markov decision processes with the total reward and average-reward optimality criteria.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Fourier Analysis and Applications

سال: 1999

ISSN: 1069-5869,1531-5851

DOI: 10.1007/bf01261608